- graph contraction
- мат.сжатие графа
English-Russian scientific dictionary. 2008.
graph contraction
Смотреть что такое "graph contraction" в других словарях:
Contraction — may refer to: In physiology: Muscle contraction, one that occurs when a muscle fiber lengthens or shortens Uterine contraction, contraction of the uterus, such as during childbirth Contraction, a stage in wound healing In linguistics: Synalepha,… … Wikipedia
Graph coloring — A proper vertex coloring of the Petersen graph with 3 colors, the minimum number possible. In graph theory, graph coloring is a special case of graph labeling; it is an assignment of labels traditionally called colors to elements of a graph… … Wikipedia
Graph operations — Operations on graphs produce new graphs from old ones. They may be separated into the following major categories. Contents 1 Unary operations 1.1 Elementary operations 1.2 Advanced operations 2 … Wikipedia
Contraction hierarchies — In applied mathematics, the method of contraction hierarchies is a technique to simplify shortest path routing by first creating precomputed contracted versions of the connection graph. It can be regarded as a special case of highway node routing … Wikipedia
Edge contraction — In graph theory, an edge contraction is an operation which removes an edge from a graph while simultaneously merging together the two vertices it previously connected. Edge contraction is a fundamental operation in the theory of graph minors.… … Wikipedia
Minor (graph theory) — In graph theory, an undirected graph H is called a minor of the graph G if H is isomorphic to a graph that can be obtained by zero or more edge contractions on a subgraph of G. The theory of graph minors began with Wagner s theorem that a graph… … Wikipedia
Biased graph — In mathematics, a biased graph is a graph with a list of distinguished circles (edge sets of simple cycles), such that if two circles in the list are contained in a theta graph, then so is the third circle of the theta graph. A biased graph is a… … Wikipedia
Hadwiger conjecture (graph theory) — In graph theory, the Hadwiger conjecture (or Hadwiger s conjecture) states that, if an undirected graph G requires k or more colors in any vertex coloring, then one can find k disjoint connected subgraphs of G such that each subgraph is connected … Wikipedia
Muscle contraction — See also: Twitch and Tremor Top down view of skeletal muscle Muscle fiber generates tension through the action of actin and myosin cross bridge cycling. While under tension, the muscle may lengthen, shorten, or … Wikipedia
Feynman graph — A Feynman graph is a graph suitable to be a Feynman diagram in a particular application of quantum field theory. (The most common use is when each field has quanta (particles) associated with it as the quantum of the electromagnetic field is a… … Wikipedia
Homeomorphism (graph theory) — In graph theory, two graphs G and G are homeomorphic if there is an isomorphism from some subdivision of G to some subdivision of G . If the edges of a graph are thought of as lines drawn from one vertex to another (as they are usually depicted… … Wikipedia
